Chinese remainder theorem

The Chinese remainder theorem is a result about congruences in number theory and its generalizations in abstract algebra.

In its most basic form it concerned with determining n, given the remainders generated by division of n by several numbers. For example what is the single lowest number if repeatedly divided by 3 gives a remainder of 2; when divided by 5 gives a remainder of 3; and when divided by 7 gives a remainder of 2?

1 Theorem statement
2 Existence
- 2.1 Case of two equations
- 2.2 General case
3 A constructive algorithm to find the solution
4 Statement for principal ideal domains
5 Statement for general rings
6 Applications
7 Non-commutative case: a counter-example
- 7.1 Proof
8 See also
9 References
10 External links

Theorem statement

The original form of the theorem, contained in a third-century AD book Sun Zi suanjing (孫子算經 The Mathematical Classic by Sun Zi) by Chinese mathematician Sun Tzu and later republished in a 1247 book by Qin Jiushao, the Shushu Jiuzhang (數書九章 Mathematical Treatise in Nine Sections) is a statement about simultaneous congruences (see modular arithmetic).

Suppose n₁, n₂, …, n_k are positive integers which are pairwise coprime. Then, for any given sequence of integers a₁,a₂, …, a_k, there exists an integer x solving the following system of simultaneous congruences.

$\begin{align} x &\equiv a_1 \pmod{n_1} \\ x &\equiv a_2 \pmod{n_2} \\ &{}\ \ \vdots \\ x &\equiv a_k \pmod{n_k} \end{align}$

Furthermore, all solutions x of this system are congruent modulo to the product N = n₁n₂…n_k.

Hence $x \equiv y \pmod{n_i}$ for all $1\leq i \leq k$ , if and only if $x \equiv y \pmod{N}.$

Sometimes, the simultaneous congruences can be solved even if the n_i's are not pairwise coprime. A solution x exists if and only if:

$a_i \equiv a_j \pmod{\gcd(n_i,n_j)} \qquad \mbox{for all }i\mbox{ and }j . \,\!$

All solutions x are then congruent modulo the least common multiple of the n_i.

Sun Zi's work contains neither a proof nor a full algorithm. What amounts to an algorithm for solving this problem was described by Aryabhata (6th century; see Kak 1986). Special cases of the Chinese remainder theorem were also known to Brahmagupta (7th century), and appear in Fibonacci's Liber Abaci (1202).

A modern restatement of the theorem in the algebraic language is that for a positive integer $n$ with prime factorization $p_1^{r_1} p_2^{r_2} \cdots p_k^{r_k}$ we have the isomorphism between a ring and the direct product of its prime power parts:

$\mathbb{Z}/n\mathbb{Z} \cong \mathbb{Z}/p_1^{r_1}\mathbb{Z} \times \mathbb{Z}/p_2^{r_2}\mathbb{Z} \times \cdots \times \mathbb{Z}/p_k^{r_k}\mathbb{Z}.$

Existence

Existence can be seen by an explicit construction of $x$ . We will use the notation $[a^{-1}]_b$ to denote the inverse of $a \pmod b$ , it is defined exactly when $a$ and $b$ are coprime - the following construction explains why the coprimality condition is needed.

Case of two equations

Given the system (corresponding to $k=2$ )

$\begin{align} x &\equiv a_1 \pmod{n_1} \\ x &\equiv a_2 \pmod{n_2}. \end{align}$

Since $\gcd(n_1, n_2)=1$ , we have from Bézout's identity

$n_2 [n_2^{-1}]_{n_1} %2B n_1 [n_1^{-1}]_{n_2} = 1.$

Multiplying both sides by $x$ , we get

$x = x n_2 [n_2^{-1}]_{n_1} %2B x n_1 [n_1^{-1}]_{n_2}.$

If we take the congruence modulo $n_1$ for the right-hand-side expression, it is readily seen that

$x n_2 [n_2^{-1}]_{n_1} %2B x n_1 [n_1^{-1}]_{n_2} \equiv x 1 %2B x 0 [n_1^{-1}]_{n_2} \equiv x \pmod {n_1}.$

But we know that

$a_1 \equiv x \pmod {n_1},$

thus this suggests that the coefficient of the first term on the right-hand-side expression should be $a_1$ . Similarly, we can show that the coefficient of the second term should be $a_2$ .

We can now define the value

$x�:= a_1 n_2 [n_2^{-1}]_{n_1} %2B a_2 n_1 [n_1^{-1}]_{n_2}$

and it is seen to satisfy both congruences by reducing. For example

$a_1 n_2 [n_2^{-1}]_{n_1} %2B a_2 n_1 [n_1^{-1}]_{n_2} \equiv a_1 1 %2B a_2 0 [n_1^{-1}]_{n_2} \equiv a_1 \pmod {n_1}.$

General case

The same type of construction works in the general case of $k$ congruence equations. Let $N = n_1 n_2 \cdots n_k$ be the product of every modulus then define

$x�:= \sum_{i} a_i \frac{N}{n_i} \left[\left(\frac{N}{n_i}\right)^{-1}\right]_{n_i}$

and this is seen to satisfy the system of congruences by a similar calculation as before.

A constructive algorithm to find the solution

The following algorithm only applies if the $n_i$ 's are pairwise coprime. (For simultaneous congruences when the moduli are not pairwise coprime, the method of successive substitution can often yield solutions.)

Suppose, as above, that a solution is required for the system of congruences:

$x \equiv a_i \pmod{n_i} \quad\mathrm{for}\; i = 1, \ldots, k.$

Again, to begin, the product $N=n_1n_2\ldots n_k$ is defined. Then a solution x can be found as follows.

For each i the integers $n_i$ and $N/n_i$ are coprime. Using the extended Euclidean algorithm we can find integers $r_i$ and $s_i$ such that $r_in_i %2B s_iN/n_i = 1$ . Then, choosing the label $e_i=s_iN/n_i$ , the above expression becomes:

$r_i n_i %2B e_i = 1. \,\!$

Consider $e_i$ . The above equation guarantees that its remainder, when divided by $n_i$ , must be 1. On the other hand, since it is formed as $s_iN/n_i$ , the presence of N guarantees that it's evenly divisible by any $n_j$ so long as $j\ne i$ .

$e_i \equiv 1 \pmod{n_i} \quad \mathrm{and} \quad e_i \equiv 0 \pmod{n_j} \quad \mathrm{for} ~ j\ne i.$

Because of this, combined with the multiplication rules allowed in congruences, one solution to the system of simultaneous congruences is:

$x = \sum_{i=1}^k a_i e_i.\!$

For example, consider the problem of finding an integer x such that

$x \equiv 2 \pmod{3}, \,\!$

$x \equiv 3 \pmod{4}, \,\!$

$x \equiv 1 \pmod{5}. \,\!$

Using the extended Euclidean algorithm for x modulo 3 and 20 [4×5], we find (−13) × 3 + 2 × 20 = 1, i.e. e₁ = 40. For x modulo 4 and 15 [3×5], we get (−11) × 4 + 3 × 15 = 1, i.e. e₂ = 45. Finally, for x modulo 5 and 12 [3×4], we get 5 × 5 + (−2) × 12 = 1, i.e. e₃ = −24. A solution x is therefore 2 × 40 + 3 × 45 + 1 × (−24) = 191. All other solutions are congruent to 191 modulo 60, [3 × 4 × 5 = 60] which means that they are all congruent to 11 modulo 60.

NOTE: There are multiple implementations of the extended Euclidean algorithm which will yield different sets of $e_1=-20$ , $e_2=-15$ , and $e_3=-24$ . These sets however will produce the same solution i.e. (-20)2+(-15)3+(-24)1=-109=11 modulo 60.

Statement for principal ideal domains

For a principal ideal domain R the Chinese remainder theorem takes the following form: If u₁, ..., u_k are elements of R which are pairwise coprime, and u denotes the product u₁...u_k, then the quotient ring R/uR and the product ring R/u₁R× ... × R/u_kR are isomorphic via the isomorphism

$f�: R/uR \rightarrow R/u_1R \times \cdots \times R/u_k R$

such that

$f(x %2BuR) = (x %2B u_1R, \ldots , x %2Bu_kR) \quad\mbox{ for every } x\in R.$

This map is well-defined and an isomorphism of rings; the inverse isomorphism can be constructed as follows. For each i, the elements u_i and u/u_i are coprime, and therefore there exist elements r and s in R with

$r u_i %2B s u/u_i = 1. \,\!$

Set e_i = s u/u_i. Then the inverse of f is the map

$g�: R/u_1R \times \cdots \times R/u_kR \rightarrow R/uR$

such that

$g(a_1%2Bu_1R,\ldots ,a_k%2Bu_kR)= \left( \sum_{i=1}^k a_i \frac{u}{u_i} \left[\left(\frac{u}{u_i}\right)^{-1}\right]_{u_i} \right) %2B uR \quad\mbox{ for all }a_1,\ldots,a_k\in R.$

Note that this statement is a straightforward generalization of the above theorem about integer congruences: the ring Z of integers is a principal ideal domain, the surjectivity of the map f shows that every system of congruences of the form

$x \equiv a_i \pmod{u_i} \quad\mathrm{for}\; i = 1, \ldots, k$

can be solved for x, and the injectivity of the map f shows that all the solutions x are congruent modulo u.

Statement for general rings

The general form of the Chinese remainder theorem, which implies all the statements given above, can be formulated for commutative rings and ideals. If R is a commutative ring and I₁, ..., I_k are ideals of R which are pairwise coprime (meaning that $I_i%2B\bigcap_{j\ne i}I_j=R$ for all $i$ ), then the product I of these ideals is equal to their intersection, and the quotient ring R/I is isomorphic to the product ring R/I₁ x R/I₂ x ... x R/I_k via the isomorphism

$f�: R/I \rightarrow R/I_1 \times \cdots \times R/I_k$

such that

$f(x %2B I) = (x %2BI_1, \ldots , x%2BI_k) \quad\text{ for all } x\in R.$

Here is a version of the theorem where R is not required to be commutative:

Let R be any ring with 1 (not necessarily commutative) and $I_1, \ldots , I_n$ be pairwise coprime 2-sided ideals. Then the canonical R-module homomorphism $R \rightarrow R/I_1 \times \cdots \times R/I_k$ is onto, with kernel $I_1\cap \cdots \cap I_k$ . Hence, $R/(I_1\cap \cdots \cap I_k) \simeq R/I_1 \times \cdots \times R/I_k$ (as R-modules).

Applications

In the RSA algorithm calculations are made modulo n, where n is a product of two large prime numbers p and q. 1024-, 2048- or 4096-bit integers n are commonly used, making calculations in $\Bbb{Z}/n\Bbb{Z}$ very time-consuming. By the Chinese remainder theorem, however, these calculations can be done in the isomorphic ring $\Bbb{Z}/p\Bbb{Z} \oplus \Bbb{Z}/q\Bbb{Z}$ instead. Since p and q are normally of about the same size, that is about $\sqrt{n}$ , calculations in the latter representation are much faster. Note that RSA algorithm implementations using this isomorphism are more susceptible to fault injection attacks.

The Chinese remainder theorem may also be used to construct an elegant Gödel numbering for sequences, which is needed to prove Gödel's incompleteness theorems.

The following example shows a connection with the classic polynomial interpolation theory. Let r complex points ("interpolation nodes") $\textstyle \lambda_1,\ldots,\lambda_r$ be given, together with the complex data $a_{j,k}\$ , for all $\textstyle 1\leq j\leq r$ and $\textstyle 0\leq k<\nu_j$ . The general Hermite interpolation problem asks for a polynomial $\textstyle P(x)\in \C[x]$ taking the prescribed derivatives in each node $\lambda_j\$ :

$P^{(k)}(\lambda_j)=a_{j,k}\quad\forall 1\leq j\leq r\ , 0\leq k<\nu_j.$

Introducing the polynomials

$\textstyle A_j(x):=\sum_{k=0}^{\nu_j-1}\frac{a_{j,k}}{k!}(x-\lambda_j)^k$ ,

the problem may be equivalently reformulated as a system of $r\$ simultaneous congruences:

$P(x)\equiv A_j(x)\pmod{(x-\lambda_j)^{\nu_j}},\quad\forall 1\leq j\leq r\ .$

By the Chinese remainder theorem in the principal ideal domain $\textstyle\C[x]$ , there is a unique such polynomial $\textstyle P(x)$ with degree $\textstyle\deg(P)<n:=\sum_j\nu_j$ . A direct construction, in analogy with the above proof for the integer number case, can be performed as follows. Define the polynomials $\textstyle Q:=\prod_{i=1}^{r}(x-\lambda_i)^{\nu_i}$ and $\textstyle Q_j:=\frac{Q}{(x-\lambda_j)^{\nu_j}}$ . The partial fraction decomposition of $\textstyle \frac{1}{Q}$ gives r polynomials $\textstyle S_j$ with degrees $\textstyle\deg(S_j)<\nu_j$ such that

$\frac{1}{Q}=\sum_{i=1}^{r}\frac{S_i}{(x-\lambda_i)^{\nu_i}}$ ,

so that $\textstyle 1=\sum_{i=1}^{r}S_i Q_i$ . Then a solution of the simultaneous congruence system is given by the polynomial

$\sum_{i=1}^{r} A_i S_i Q_i = A_j %2B \sum_{i=1}^{r}(A_i-A_j) S_i Q_i\equiv A_j\pmod{(x-\lambda_j)^{\nu_j}}\quad\forall 1\leq j\leq r\$ ;

and the minimal degree solution is this one reduced modulo $\textstyle Q$ , that is the unique with degree less than n.

The Chinese remainder theorem can also be used in Secret sharing, which consists of distributing a set of shares among a group of people who, all together (but no one alone), can recover a certain secret from the given set of shares. Each of the shares is represented in a congruence, and the solution of the system of congruences using the Chinese remainder theorem is the secret to be recovered. Secret Sharing using the Chinese Remainder Theorem uses, along with the Chinese remainder theorem, special sequences of integers that guarantee the impossibility of recovering the secret from a set of shares with less than a certain cardinality.

The Good-Thomas fast Fourier transform algorithm exploits a re-indexing of the data based on the Chinese remainder theorem. The Prime-factor FFT algorithm contains an implementation.

Dedekind's theorem on the linear independence of characters states (in one of its most general forms) that if M is a monoid and k is an integral domain, then any finite family $\left(f_i\right)_{i\in I}$ of distinct monoid homomorphisms $f_i:M\to k$ (where the monoid structure on k is given by multiplication) is linearly independent, i. e. every family $\left(\alpha_i\right)_{i\in I}$ of elements $\alpha_i\in k$ satisfying $\sum_{i\in I}\alpha_i f_i=0$ must be equal to the family $\left(0\right)_{i\in I}$ .

Proof using the Chinese Remainder Theorem: First, assume that k is a field (otherwise, replace the integral domain k by its quotient field, and nothing will change). We can linearly extend the monoid homomorphisms $f_i:M\to k$ to k-algebra homomorphisms $F_i:k\left[M\right]\to k$ , where $k\left[M\right]$ is the monoid ring of M over k. Then, the condition $\sum_{i\in I}\alpha_i f_i=0$ yields $\sum_{i\in I}\alpha_i F_i=0$ by linearity. Now, we notice that if $i\neq j$ are two elements of the index set I, then the two k-linear maps $F_i:k\left[M\right]\to k$ and $F_j:k\left[M\right]\to k$ are not proportional to each other (because if they were, then $f_i$ and $f_j$ would also be proportional to each other, and thus equal to each other since $f_i\left(1\right)=1=f_j\left(1\right)$ (since $f_i$ and $f_j$ are monoid homomorphisms), contradicting the assumption that they be distinct). Hence, their kernels $\mathrm{Ker} F_i$ and $\mathrm{Ker} F_j$ are distinct. Now, $\mathrm{Ker} F_i$ is a maximal ideal of $k\left[M\right]$ for every $i\in I$ (since $k\left[M\right] / \mathrm{Ker} F_i\cong F_i\left(k\left[M\right]\right)=k$ is a field), and the ideals $\mathrm{Ker} F_i$ and $\mathrm{Ker} F_j$ are coprime whenever $i\neq j$ (since they are distinct and maximal). The Chinese Remainder Theorem (for general rings) thus yields that the map

$\phi: k\left[M\right] / K\to \prod_{i\in I}k\left[M\right] / \mathrm{Ker} F_i$

given by

$\phi\left(x%2BK\right)=\left(x%2B\mathrm{Ker} F_i\right)_{i\in I}$ for all $x\in k\left[M\right]$

is an isomorphism, where $K=\prod_{i\in I}\mathrm{Ker} F_i=\bigcap_{i\in I}\mathrm{Ker} F_i$ . Consequently, the map

$\Phi: k\left[M\right]\to \prod_{i\in I}k\left[M\right] / \mathrm{Ker} F_i$

given by

$\Phi\left(x\right)=\left(x%2B\mathrm{Ker} F_i\right)_{i\in I}$ for all $x\in k\left[M\right]$

is surjective. Under the isomorphisms $k\left[M\right] / \mathrm{Ker} F_i\to F_i\left(k\left[M\right]\right)=k$ , this map $\Phi$ corresponds to the map

$\psi: k\left[M\right]\to \prod_{i\in I}k$

given by

$x\mapsto\left(F_i\left(x\right)\right)_{i\in I}$ for every $x\in k\left[M\right]$ .

Now, $\sum_{i\in I}\alpha_i F_i=0$ yields $\sum_{i\in I}\alpha_i u_i=0$ for every vector $\left(u_i\right)_{i\in I}$ in the image of the map $\psi$ . Since $\psi$ is surjective, this means that $\sum_{i\in I}\alpha_i u_i=0$ for every vector $\left(u_i\right)_{i\in I}\in \prod_{i\in I}k$ . Consequently, $\left(\alpha_i\right)_{i\in I}=\left(0\right)_{i\in I}$ , qed.

Non-commutative case: a counter-example

The Chinese remainder theorem does not hold in the non-commutative case. Consider the ring R of non-commutative real polynomials in x and y. Let I be the principal two-sided ideal generated by x and J the principal two-sided ideal generated by $xy%2B1.$ Then $I%2BJ=R$ but $I\cap J \neq IJ.$

Proof

Observe that I is formed by all polynomials with an x in every term and that every polynomial in J vanishes under the substitution $y=-1/x$ . Consider the polynomial $p=(xy%2B1)x$ . Clearly $p\in I\cap J$ . Define a term in R as an element of the multiplicative monoid of R generated by x and y. Define the degree of a term as the usual degree of the term after the substitution $y=x$ . On the other hand, suppose $q\in J$ . Observe that a term in q of maximum degree depends on y otherwise q under the substitution $y=-1/x$ can not vanish. The same happens then for an element $q\in IJ$ . Observe that the last y, from left to right, in a term of maximum degree in an element of $IJ$ is preceded by more than one x. (We are counting here all the preceding xs. e.g. in $x^2yxyx^5$ the last y is preceded by $3$ xs.) This proves that $(xy%2B1)x\notin IJ$ since that last y in a term of maximum degree ( $xyx$ ) is preceded by only one x. Hence $I\cap J\neq IJ$ .

On the other hand, it is true in general that $I%2BJ = R$ implies $I \cap J = IJ %2B JI$ . To see this, note that $I \cap J = (I \cap J) (I%2BJ) \subset IJ %2B JI$ , while the opposite inclusion is obvious. Also, we have in general that, provided $I_1, \ldots, I_m$ are pairwise coprime two-sided ideals in R, the natural map

$R / (I_1 \cap I_2 \cap \ldots \cap I_m) \rightarrow R/I_1 \oplus R/I_2 \oplus \cdots \oplus R/I_m$

is an isomorphism. Note that $I_1 \cap I_2 \cap \ldots \cap I_m$ can be replaced by a sum over all orderings of $I_1, \ldots, I_m$ of their product (or just a sum over enough orderings, using inductively that $I \cap J = IJ %2B JI$ for coprime ideals $I, J$ ).

References

Donald Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89684-2. Section 4.3.2 (pp.286–291), exercise 4.6.2–3 (page 456).
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Section 31.5: The Chinese remainder theorem, pp.873–876.
Laurence E. Sigler (trans.) (2002). Fibonacci's Liber Abaci. Springer-Verlag. pp. 402–403. ISBN 0-387-95419-8.
Kak, Subhash (1986), "Computational aspects of the Aryabhata algorithm", Indian Journal of History of Science 21 (1): 62–71, http://www.ece.lsu.edu/kak/AryabhataAlgorithm.pdf .
Thomas W. Hungerford (1974). Algebra. Springer-Verlag. pp. 131–132. ISBN 0-387-90518-9.
Cunsheng Ding, Dingyi Pei, and Arto Salomaa (1996). Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography. World Scientific Publishing. pp. 1–213. ISBN 981-02-2827-9.

External links

"Chinese Remainder Theorem" by Ed Pegg, Jr., Wolfram Demonstrations Project, 2007.
Weisstein, Eric W., "Chinese Remainder Theorem" from MathWorld.
C# program and discussion at codeproject
University of Hawaii System CRT by Lee Lady
Full text of the Sunzi Suanjing (Chinese) - Chinese Text Project

Chinese remainder theorem

Contents

Theorem statement

Existence

Case of two equations

General case

A constructive algorithm to find the solution

Statement for principal ideal domains

Statement for general rings

Applications

Non-commutative case: a counter-example

Proof

See also

References

External links